import sys, os, io
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
n, m, r = map(int, input().split())
s = list(map(int, input().split()))
b = list(map(int, input().split()))
mi = min(s)
c = r // mi
ans = max(r, r % mi + max(b) * c)
print(ans)#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long
#define vvi vector<vector<int>>
#define vi vector<int>
#define pb push_back
int main(){
int n,m,r;
cin>>n>>m>>r;
int a[n];
int b[m];
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<m;i++) cin>>b[i];
int min = INT32_MAX;
int max = INT32_MIN;
for(int i=0;i<n;i++){
if(a[i]<min) min = a[i];
}
for(int i=0;i<m;i++){
if(b[i]>max) max = b[i];
}
if(max<=min){
cout<<r<<endl;
}else{
int num = r/min;
int diff = max-min;
r+= num*diff;
cout<<r<<endl;
}
}Lexical Sorting Reloaded | 1514A - Perfectly Imperfect Array |
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |
1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |
1299. Replace Elements with Greatest Element on Right Side | 1768. Merge Strings Alternately |